Some Results about the Use of Tree/String Edit Distances in a~Nearest Neighbour Classification Task
نویسندگان
چکیده
In pattern recognition there is a variety of applications where the patterns are classi ed using edit distance. In this paper we present some results comparing the use of tree and string edit distances in a handwritten character recognition task. Some experiments with di erent number of classes and of classi ers are done.
منابع مشابه
Some results about the use of tree/string edit distances in a nearest neighbour classi cation task
In pattern recognition there is a variety of applications where the patterns are classi ed using edit distance. In this paper we present some results comparing the use of tree and string edit distances in a handwritten character recognition task. Some experiments with di erent number of classes and of classi ers are done.
متن کاملComparison of AESA and LAESA search algorithms using string and tree-edit-distances
Although the success rate of handwritten character recognition using a nearest neighbour technique together with edit distance is satisfactory, the exhaustive search is expensive. Some fast methods as AESA and LAESA have been proposed to find nearest neighbours in metric spaces. The average number of distances computed by these algorithms is very low and does not depend on the number of prototy...
متن کاملFinding Significant Points for a Handwritten Classification Task
When objects are represented by curves in a plane, highly useful information is conveyed by significant points. In this paper, we compare the use of different mobile windows to extract dominant points of handwritten characters. The error rate and classification time using an edit distance based nearest neighbour search algorithm are compared for two different cases: string and tree representation.
متن کاملSome improvements on NN based classifiers in metric spaces
The nearest neighbour (NN) and k-nearest neighbour (k-NN) classification rules have been widely used in Pattern Recognition due to its simplicity and good behaviour. Exhaustive nearest neighbour search may become unpractical when facing large training sets, high dimensional data or expensive dissimilarity measures (distances). During the last years a lot of fast NN search algorithms have been d...
متن کاملEdit Distance for Ordered Vector Sets: A Case of Study
Digital contours in a binary image can be described as an ordered vector set. In this paper an extension of the string edit distance is de ned for its computation between a pair of ordered sets of vectors. This way, the di erences between shapes can be computed in terms of editing costs. In order to achieve e cency a dominant point detection algorithm should be applied, removing redundant data ...
متن کامل